Kleene Theorems for Product Systems
نویسندگان
چکیده
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from well-studied subclasses of 1bounded Petri nets. For product T-systems we define a corresponding class of expressions. The algorithms from systems to expressions and in the reverse direction are both polynomial time. For product free choice systems with a restriction of structural cyclicity, that is, the initial global state is a feedback vertex set, going from systems to expressions is still polynomial time; in the reverse direction it is polynomial time with access to an NP oracle for finding deadlocks.
منابع مشابه
Kleene Theorems for Labelled Free Choice Nets
In earlier work [LMP11], we showed that a graph-theoretic condition called “structural cyclicity” enables us to extract syntax from a conflict-equivalent product system of automata. In this paper we have a “pairing” property in our syntax which allows us to connect to a broader class of product systems, where the conflict-equivalence is not statically fixed. These systems have been related to l...
متن کاملUntyping Typed Algebraic Structures
Algebraic structures sometimes need to be typed. For example, matrices over a ring form a ring, but the product is a only a partial operation: dimensions have to agree. Therefore, an easy way to look at matrices algebraically is to consider “typed rings”. We prove some “untyping” theorems: in some algebras (semirings, Kleene algebras, residuated monoids), types can be reconstructed from valid u...
متن کاملKleene Theorems for Labelled Free Choice Nets without product acceptance condition
In an earlier work [18], we provided expressions for free choice nets having “distributed choice property” which makes the nets “direct product” representable. In a recent work [17], we gave equivalent syntax for a larger class of free choice nets obtained by dropping “distributed choice property”, thus syntactically characterizing nets which are not representable by direct products also. In bo...
متن کاملUsing probabilistic Kleene algebra pKA for protocol verification
We propose a method for verification of probabilistic distributed systems in which a variation of Kozen’s Kleene Algebra with Tests [11] is used to take account of the well-known interaction of probability and “adversarial” scheduling [17]. We describe pKA, a probabilistic Kleene-style algebra, based on a widely accepted model of probabilistic/demonic computation [7,25,17]. Our technical aim is...
متن کاملKleene Theorems for Synchronous Products with Matching
In earlier work [LMP11], we showed that a graph-theoretic condition called “structural cyclicity” enables us to extract syntax from a conflict-equivalent product system of automata. In this paper we have a “pairing” property in our syntax which allows us to connect to a broader class of synchronous product systems [Arn94] with a “matching” property, where the conflict-equivalence is not statica...
متن کامل